- multiplicative factor
- множитель
English-Russian small dictionary of medicine. 2015.
English-Russian small dictionary of medicine. 2015.
Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… … Wikipedia
Factor of automorphy — In mathematics, the notion of factor of automorphy arises for a group acting on a complex analytic manifold. Suppose a group G acts on a complex analytic manifold X. Then, G also acts on the space of holomorphic functions from X to the complex… … Wikipedia
Multiplication factor — may refer to: Neutron multiplication factor, in a nuclear chain reaction Multiplication factor, a term used in digital photography Multiplication factor or gas gain in gas ionization detectors used in Nuclear and Particle Physics. See also… … Wikipedia
Twiddle factor — A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients that are multiplied by the data in the course of the algorithm. This term was apparently coined by Gentleman amp; Sande in 1966, and… … Wikipedia
Landé g-factor — In physics, the Landé g factor is a particular example of a g factor, namely for an electron with both spin and orbital angular momenta. It is named after Alfred Landé, who first described it in 1921.In atomic physics, it is a multiplicative term … Wikipedia
Filter factor — In photography, filter factor refers to the multiplicative amount of light a filter blocks.Converting between filter factors and stopsThe table below illustrates the relationship between filter factor, the amount of light that is allowed through… … Wikipedia
Prime-factor FFT algorithm — The Prime factor algorithm (PFA), also called the Good Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re expresses the discrete Fourier transform (DFT) of a size N = N 1 N 2 as a two dimensional N 1 times; N 2 DFT … Wikipedia
Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Feynman diagram — The Wick s expansion of the integrand gives (among others) the following termNarpsi(x)gamma^mupsi(x)arpsi(x )gamma^ upsi(x )underline{A mu(x)A u(x )};,whereunderline{A mu(x)A u(x )}=int{d^4pover(2pi)^4}{ig {mu u}over k^2+i0}e^{ k(x x )}is the… … Wikipedia
Convolution — For the usage in formal language theory, see Convolution (computer science). Convolution of two square pulses: the resulting waveform is a triangular pulse. One of the functions (in this case g) is first reflected about τ = 0 and then offset by t … Wikipedia